Grid Branch-and-Bound for Permutation Flowshop
نویسندگان
چکیده
Flowshop is an example of a classic hard combinatorial problem. Branch-and-bound is a technique commonly used for solving such hard problems. Together, the two can be used as a benchmark of maturity of parallel processing environment. Grid systems pose a number of hurdles which must be overcome in practical applications. We give a report on applying parallel branch-and-bound for flowshop in grid environment. Methods dealing with the complexities of the environment and the application are proposed, and evaluated.
منابع مشابه
A Branch-and-Bound Based Heuristic Algorithm for Minimizing Makespan in Machining-Assembly Flowshop Scheduling
This paper proposes a heuristic algorithm, called list-based squeezing branch and bound algorithm, for solving a machine-fixed, machining-assembly flowshop scheduling problem to minimize makespan. The machine-fixed, machining-assembly flowshop consists of some parallel two-machine flow lines at a machining stage and one robot at an assembly stage. Since an optimal schedule for this problem is n...
متن کاملOptimal Scheduling Algorithms to Minimize Total Flowtime on a Two-Machine Permutation Flowshop with Limited Waiting Times and Ready Times of Jobs
In this research, we consider a two-machine permutation flowshop with ready times and limited waiting times of jobs in a semiconductor fab. In the flowshop, each job has its corresponding ready time (arrival time) at machine 1 (for the first operation) and limited waiting time between the completion time of the first operation on machine 1 and the starting time of the second operation on machin...
متن کاملBi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects
In traditional scheduling problems, the processing time for the given job is assumed to be a constant regardless of whether the job is scheduled earlier or later. However, the phenomenon named ‘‘learning effect’’ has extensively been studied recently, in which job processing times decline as workers gain more experience. This paper discusses a bi-criteria scheduling problem in anm-machine permu...
متن کاملIntegrative Cooperative Approach for Solving Permutation Flowshop Scheduling Problem with Sequence Dependent Family Setup Times
This paper addresses to the permutation flowline manufacturing cell with sequence dependent family setup times problem. The objective is to minimize the makespan criterion. We propose a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance the current solution. Moreover, the ap...
متن کاملMakespan minimization for m-machine permutation flowshop scheduling problem with learning considerations
Studies on scheduling with learning considerations have recently become important. Most studies focus on single-machine settings. However, numerous complex industrial problems can be modeled as flowshop scheduling problems. This paper thus focuses on minimizing the makespan in an m-machine permutation flowshop with learning considerations. This paper proposes a dominance theorem and a lower bou...
متن کامل